When Are the (un)constrained Stationary Points of the Implicit Lagrangian Global Solutions?
نویسندگان
چکیده
1993] proposed to solve nonlinear complementarity problems by seeking the unconstrained global minima of a new merit function which they called implicit Lagrangian. A crucial point in such an approach is to determine conditions which guarantee that every uncon-strained stationary point of the implicit Lagrangian is a global solution, since standard unconstrained minimization techniques are only able to locate stationary points. Some authors partially answered this question by giving suucient conditions which guarantee this key property. In this paper we settle the issue by giving a necessary and suucient condition for a stationary point of the implicit Lagrangian to be a global solution and, hence, a solution of the nonlinear complementarity problem. We show that this new condition easily allows us to recover all previous results and to establish new suucient conditions. We then consider a constrained reformulation based on the implicit Lagrangian in which nonnegative constraints on the variables are added to the original unconstrained reformu-lation. This is motivated by the fact that often, in applications, the function which deenes the complementarity problem is deened only on the nonnegative orthant. We consider the KKT-points of this new reformulation and show that the same necessary and suucient condition which guarantees, in the unconstrained case, that every unconstrained stationary point is a global solution, also guarantees that every KKT-point of the new problem is a global solution.
منابع مشابه
An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints
This paper is aimed toward the definition of a new exact augmented Lagrangian function for two-sided inequality constrained problems. The distinguishing feature of this augmented Lagrangian function is that it employs only one multiplier for each two-sided constraint. We prove that stationary points, local minimizers and global minimizers of the exact augmented Lagrangian function correspond ex...
متن کاملStationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems
We consider two merit functions which can be used for solving the nonlinear complementarity problem via nonnegatively constrained minimization. One of the functions is the restricted implicit Lagrangian (Refs. 1-3), and the other appears to be new. We study the conditions under which a stationary point of the minimization problem is guaranteed to be a solution of the underlying complementarity ...
متن کاملSolution of linear complementarity problems using minimization with simple bounds
We deene a minimization problem with simple bounds associated to the horizontal linear complementarity problem (HLCP). When the HLCP is solvable, its solutions are the global minimizers of the associated problem. When the HLCP is feasible, we are able to prove a number of properties of the stationary points of the associated problem. In many cases, the stationary points are solutions of the HLC...
متن کاملDifference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
This paper studies a fundamental bicriteria optimization problem for variable selection in statistical learning; the two criteria are a loss/residual function and a model control (also called regularization, penalty). The former function measures the fitness of the learning model to data and the latter function is employed as a control of the complexity of the model. We focus on the case where ...
متن کاملA Stabilized Sqp Method: Global Convergence
Stabilized sequential quadratic programming (SQP) methods for nonlinear optimization are designed to provide a sequence of iterates with fast local convergence regardless of whether or not the active-constraint gradients are linearly dependent. This paper concerns the global convergence properties of a stabilized SQP method with a primal-dual augmented Lagrangian merit function. The proposed me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007